Efficient Elliptic Curve Point Multiplication with Montgomery Ladder Algorithm

Scalar point multiplication has encountered significant attention in Elliptic curve cryptography (ECC) which is gaining popularity due to providing same level security with smaller key sizes compared to traditional cryptosystems, such as Ron Rivest, Adi Shamir, and Leonard Adleman (RSA). Point multiplication (KP) in ECC is basically performed on point addition and point doubling on elliptic curves. This performance has applied in different approaches such as NAF method, Montgomery ladder algorithm, binary method that is just point addition and point doubling. In this paper, improving an algorithm of public key cryptography, Montgomery Ladder, goes under review to make an efficient Elliptic Curve point multiplication in terms of area and throughput. This algorithm computes point multiplication on Elliptic Curves such as generic curves in which it is optimized by using parallel multipliers in Digit size architectures.